Solving the Ride-Sharing Problem with Non-Homogeneous Vehicles by Using an Improved Genetic Algorithm with Innovative Mutation Operators and Local Search Methods

An increase in the number of vehicles in cities leads to several problems, including air pollution, noise pollution, and congestion. To overcome these problems, we need to use new urban management methods, such as using intelligent transportation systems like ride-sharing systems. The purpose of this study is to create and implement an improved genetic algorithms model for ride-sharing with non-homogeneous vehicles (like taxis and vans with a capacity of 4 and 10 passengers). The proposed genetic algorithm can group passengers according to their trip similarity based on Spatio-temporal parameters to reduce the number of empty seats in vehicles, followed by the number of vehicles through the city, and get the optimal traveling path for each group of passengers. Optimal traveling path planning should also be considered to minimize each groupchr('39')s travel distance and, as a result, the time delays during the trip for each passenger and driver. Therefore, in this algorithm, four objective functions are considered. The objectives include minimizing the total travel distance of trips, the entire time delay (deviation from ideal times) at the origin and destination of passengers, number of vehicles, and number of empty seats. Due to the previous studies and the lack of combination of these objective functions mentioned above, in this article, complete research was conducted to create a model by combining these objective functions. Combining these objective functions complicates the model and, consequently, presents challenges in its implementation. To overcome these problems, Two innovative mutation operators and two local search algorithms under the titles of genetic algorithm and innovative algorithm based on passengerschr('39') travel time priority proposed to improve the genetic algorithmchr('39')s exploitation ability and to reach the global optimum answer. The first innovative mutation operator is called join-vehicles. This innovative operator aimed to reduce the number of used vehicles by using vehicleschr('39') maximum capacity to serve passengers. As discussed in this paper, conventional mutation operators such as insert or scramble operators do not have adequate ability to solve this problem. In this innovative method, the indices of two genes related to two random vehicleschr('39') positions in the entered chromosome are chosen randomly. The goal is to remove the second vehicle and combine its passengers with the first vehicle to travel beside its passengers. Also, the arrangement of boarding and disembarking this set of passengers is planned in a way that the carchr('39')s capacity condition is always satisfied; therefore, there will no longer be a restriction on passengerschr('39') combination in a van with a taxi vice versa. The second innovative mutation operator was proposed to change the van into a taxi. During the training, we would observe that some vans were used to serve the passengers while less than half of their capacity was occupied. At first, this operator replaces the van vehicles on the input chromosome with random taxis not used on the chromosome and recalculates this chromosomechr('39')s cost with the new state. If this new state reduces the chromosomechr('39')s cost, the taxi will be replaced with that van in the chromosome. Another issue that arises after applying the mentioned mutation operators on the chromosome is how to take turns for passengers to board and disembark in altered parts of the chromosome to respond to requests optimally. Therefore, two local search algorithms based on the innovative passengerschr('39') time priority to board and disembark and the traditional genetic algorithm have been implemented to increase the solution quality. These two algorithms are applied to the altered part(s) of the input chromosome and replace the resulting output with this/these part(s). About the innovative local search algorithm based on the time priority of boarding and disembarking passengers, a passenger whose expected time to board is earlier than the other passengers of a group gets on the vehicle first. This passengerchr('39')s expected time to get off at his destination is compared with the other passengerschr('39') expected time to board if he/she has higher priority than the others. Then the vehicle reaches him/her to his/her destination first. Then the vehicle goes to the origin of the next passenger, who has more priority to get in the vehicle. According to passengerschr('39') expected time priority, this procedure is repeated to board and disembark them properly. In this model, 18 travel requests, including 26 passengers (some travel requests included more than one passenger), were considered, which want to be transferred in a hypothetical road network that contains 46 nodes and 75 edges. Finally, the implemented model was tested and evaluated during six different scenarios. The results indicate the efficiency of the implemented model of this paper. It should be noted that according to the chromosome encoding method used in this paper, which is similar to some previous studies, the model of this paper can be used, tested, and evaluated in other areas related to the vehicle routing problem.